We calculate the character table of a sharply 5-transitive subgroup of Alt(12), and of a sharply 4-transitive subgroup of Alt(11). Our presentation of these calculations is new because we make no reference to the sporadic simple Mathieu groups, and instead deduce the desired character tables using only the existence of the stated multiply transitive permutation representations.

Polytrauma indicates a condition in which a patient is affected by several serious injuries. This condition can threaten life of a child. These injuries normally involve two or more crucial parts of body. Falling from height and motor accident are the two most common causes of pediatric multiple trauma. Around 30% of children with serious trauma die because of inadequate primitive assessment. To reduce the rate of mortality and morbidity, it is essential to know the primary and then the secondary survey of the patient (1)...

The goal of the present article is to study the different form of the multiply figurative speeches in the Persian poetry. The attempt is to classify the of figurative speeches. The methodology in this paper is library research and the obtained results are presented analytically and descriptively.multiply figurative speeches are the rare form of the figurative speech in which one figurative speech is combined with the another but with a new adornment and form a new one. Based of this analysis multiply figurative speeches are divided into two forms.a) The combination of two figurative speeches with each other. That is of two kinds combination of one figurative speech with itself. like metaphore to metaphore which is divided into three forms. Metaphore to metaphore in stipulated metaphore metaphore to metaphore in the covered metaphore. Finally the combination of the stipulated metaphore with the covered one. Simili to simili, allusion to allusion, and allegory to allegory. The combination of one figurative with another like simili after metaphore, metaphore to simili, allusion to simili and etc…b) The combination of one Figurative speech with a new adornment, like metaphore to ambiguty, in the simili. c) Before studying these figurative speeches in the Persian literatures, I have analysed them from aesthetic point of view based on different theories.

We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is Pm(G)=(2q/p)Pm(G\{u, n})where Pm(G) denotes the number of perfect matchings in G, G\{ u, n} is the graph constructed from G by deleting edges with an end vertex in {u, n} and unÎE(G).

This paper proposes an Integer Programming model to obtain the Least Common multiply (LCM) for some integer numbers. The proposed method is illustrated by a numerical example.

In the study of partially ordered sets, topologies such as Scott-topology have shown to be of paramount importance. In order to have analogous topology-like tools in the more general setting of quantitative domains, we introduce a method to construct Scott-topology on a set equipped with a transitive binary relation which we call t-set. As an application of this result there is a Scott-topology associated to any topology induced by its specialization pre-ordered relation. Some relations between this topology and the original topology are investigated.

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexity indices of them (1973, 2001). In this paper, with a simple method, we calculate the automorphism group of some weighted graphs.